skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Bates, Erik"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Electronic Journal of Probability)
    Free, publicly-accessible full text available March 7, 2026
  2. ; (, Communications in Mathematical Physics)
    Full Text Available 
  3. ; (, Communications in Mathematical Physics)
    Full Text Available 
  4. ; (, Electronic Journal of Probability)
    Full Text Available 
  5. ; ; (, Electronic Journal of Probability)
    Full Text Available 
  6. ; (, Random Structures & Algorithms)
    Abstract A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be anavoidance couplingif the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in particular how many walkers an avoidance coupling can include. For other graphs, apart from special cases, it has been unsettled whether even two noncolliding simple random walkers can be coupled. In this article, we construct such a coupling on (i) anyd‐regular graph avoiding a fixed subgraph depending ond; and (ii) any square‐free graph with minimum degree at least three. A corollary of the first result is that a uniformly random regular graph onnvertices admits an avoidance coupling with high probability. 
    more » « less
    Full Text Available 
  7. (, Electronic Journal of Probability)
    Full Text Available 
  8. ; (, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques)
    null (Ed.)
    Full Text Available 
  9. ; (, The Annals of Probability)
    null (Ed.)
    Full Text Available